package com.jiang.daily.Q1304;

/**
 * @author Jiang
 * @version 1.0
 * @date 2025/09/08 11:33
 */
class Solution {
    public int[] sumZero(int n) {
        int[] res = new int[n];
        int m = n / 2;
        for (int i = 0; i < m; i++) {
            res[i] = i + 1;
            res[i + m] = -i - 1;
        }
        return res;
    }
}
